System and method of  feature selection for text classification using subspace sampling

ABSTRACT

An improved system and method is provided for feature selection for text classification using subspace sampling. A text classifier generator may be provided for selecting a small set of features using subspace sampling from the corpus of training data to train a text classifier for using the small set of features for classification of texts. To select the small set of features, a subspace of features from the corpus of training data may be randomly sampled according to a probability distribution over the set of features where a probability may be assigned to each of the features that is proportional to the square of the Euclidean norms of the rows of left singular vectors of a matrix of the features representing the corpus of training texts. The small set of features may classify texts using only the relevant features among a very large number of training features.

FIELD OF THE INVENTION

The invention relates generally to computer systems, and more particularly to an improved system and method of feature selection for text classification using subspace sampling.

BACKGROUND OF THE INVENTION

Text classification, the task of automatically assigning categories to natural language text, has become one of the key methods for organizing online information. Automated text classification is a particularly challenging task in modern data analysis, both from an empirical and from a theoretical perspective. This problem is of central interest in many internet applications, and consequently it has received attention from researchers in such diverse areas as information retrieval, machine learning, and the theory of algorithms. Challenges associated with automated text categorization come from many fronts: an appropriate data structure must be chosen to represent the documents; an appropriate objective function must be chosen to optimize in order to avoid over fitting and obtain good generalization; and algorithmic issues arising as a result of the high formal dimensionality of the data must be addressed.

Feature selection of a subset of the features available for describing the data before applying a learning algorithm is a common technique for addressing this last challenge. See for example, A. L. Blum and P. Langley, Selection of Relevant Features and Examples in Machine Learning, Artificial Intelligence, 97:245-271, 1997; G. Forman, An Extensive Empirical Study of Feature-Selection Metrics for Text Classification, Journal of Machine Learning Research, 3:1289-1305, 2003; and I. Guyon and A. Elisseeff, An Introduction to Variable and Feature Selection, Journal of Machine Learning Research, 3:1157-1182, 2003. It has been widely observed that feature selection can be a powerful tool for simplifying or speeding up computations, and when employed appropriately it can lead to little loss in classification quality. Nevertheless, general theoretical performance guarantees are modest and it is often difficult to claim more than a vague intuitive understanding of why a particular feature selection algorithm performs well when it does. Indeed, selecting an optimal set of features is in general difficult, both theoretically and empirically, and in practice greedy heuristics are often employed.

Recent work in applied data analysis—for example, work on Regularized Least Squares Classification (RLSC), Support Vector Machine (SVM) classification, and the Lasso shrinkage and selection method for linear regression and classification employ the Singular Value Decomposition, which, upon truncation, results in a small number of dimensions, each of which is a linear combination of up to all of the original features. See for example, D. Fragoudis, D. Meretakis, and S. Likothanassis, Integrating Feature and Instance Selection for Text Classification, In Proceedings of the 8th Annual ACM SIGKDD Conference, pages 501-506, 2002, and T. Joachims, Text Categorization with Support Vector Machines: Learning with Many Relevant Features, In Proceedings of the 10th European Conference on Machine Learning, pages 137-142, 1998. Although RLSC performs comparable to the popular SVMs for text categorization, RLSC is conceptually and theoretically simpler than SVMs, since RLSC can be solved with vector space operations instead of convex optimization techniques required by SVMs. In practice, however, RLSC is often slower, in particular for problems where the mapping to the feature space is not the identity. For a nice overview, see R. Rifkin, Everything Old Is New Again: A Fresh Look at Historical Approaches in Machine Learning, PhD thesis, Massachusetts Institute of Technology, 2002, and R. Rifkin, G. Yeo, and T. Poggio, Regularized Least-Squares Classification, in J. A. K. Suykens, G. Horvath, S. Basu, C. Micchelli, and J. Vandewalle, editors, Advances in Learning Theory: Methods, Models and Applications, NATO Science Series III: Computer and Systems Sciences, pages 131-154. VIOS Press, 2003.

What is needed is a system and method for RLSC to efficiently learn classifications function and perform feature selection to find a small set of features that may preserve the relevant geometric structure in the data. Such a system and method should be able to be used by online applications for text classification where the text content may change rapidly.

SUMMARY OF THE INVENTION

Briefly, the present invention may provide a system and method of feature selection for text classification using subspace sampling. A text classifier generator may be provided for learning classification functions and may include a feature selector for selecting a small set of features using subspace sampling from the corpus of training data to train a text classifier for using the small set of features selected by subspace sampling for classification of texts. The small set of features may classify texts using only the relevant features among a very large number of training features. In an embodiment, the small set of features may be selected by randomly sampling features according to a probability distribution over the set of training features.

In general, features of a corpus of training data may be sampled according to an input probability distribution and a small set of features may be selected. A kernel matrix may be defined over the small set of features selected from a randomly sampled subspace of the training features, and an optimal vector representing the small set of features may be defined using regularized least-squares classification that may characterize a classification function using the kernel matrix. An unseen text may then be classified using the classification function. In various embodiments, a text classifier may be generated for using the small set of features selected by subspace sampling for classification of texts.

To select the small set of features, a subspace of features from the corpus of training data may be randomly sampled in an embodiment according to a probability distribution over the set of features where a probability may be assigned to each of the features that is proportional to the square of the Euclidean norms of the rows of left singular vectors of a matrix of the features representing the corpus of training texts. The present invention may flexibly use other probability distributions for randomly sampling features. For instance, weight-based sampling of features may be used, where the probability of choosing each feature is proportional to the length squared of the corresponding row of a matrix of the features representing the corpus of training texts. Or, uniform sampling of features may be used, where the probability of choosing each feature is equal.

Advantageously, the present invention may be used by many applications for feature selection for text classification using subspace sampling. For example, a document classification application may use the present invention to select only the relevant features among a very large number of features to speed up classification of documents. Many other internet applications may use the present invention for text classification where the content of web pages such as chat pages, blog pages, a stream of news items, email, and so forth, may change rapidly, and classification of a web page may be performed online to select content. For any of these applications, the present invention may be used, especially when computational resources including memory, processing time, and network transmission time, require that textual content be represented using a small number of features.

Other advantages will become apparent from the following detailed description when taken in conjunction with the drawings, in which:

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram generally representing a computer system into which the present invention may be incorporated;

FIG. 2 is a block diagram generally representing an exemplary architecture of system components for feature selection for text classification using subspace sampling, in accordance with an aspect of the present invention;

FIG. 3 is a flowchart generally representing the steps undertaken in one embodiment for feature selection for text classification using subspace sampling, in accordance with an aspect of the present invention; and

FIG. 4 is a flowchart generally representing the steps undertaken in an embodiment for selecting a subset of features using subspace sampling, in accordance with an aspect of the present invention.

DETAILED DESCRIPTION Exemplary Operating Environment

FIG. 1 illustrates suitable components in an exemplary embodiment of a general purpose computing system. The exemplary embodiment is only one example of suitable components and is not intended to suggest any limitation as to the scope of use or functionality of the invention. Neither should the configuration of components be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary embodiment of a computer system. The invention may be operational with numerous other general purpose or special purpose computing system environments or configurations.

The invention may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, and so forth, which perform particular tasks or implement particular abstract data types. The invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in local and/or remote computer storage media including memory storage devices.

With reference to FIG. 1, an exemplary system for implementing the invention may include a general purpose computer system 100. Components of the computer system 100 may include, but are not limited to, a CPU or central processing unit 102, a system memory 104, and a system bus 120 that couples various system components including the system memory 104 to the processing unit 102. The system bus 120 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus also known as Mezzanine bus.

The computer system 100 may include a variety of computer-readable media. Computer-readable media can be any available media that can be accessed by the computer system 100 and includes both volatile and nonvolatile media. For example, computer-readable media may include volatile and nonvolatile computer storage media implemented in any method or technology for storage of information such as computer-readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by the computer system 100. Communication media may include computer-readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. For instance, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared and other wireless media.

The system memory 104 includes computer storage media in the form of volatile and/or nonvolatile memory such as read only memory (ROM) 106 and random access memory (RAM) 110. A basic input/output system 108 (BIOS), containing the basic routines that help to transfer information between elements within computer system 100, such as during start-up, is typically stored in ROM 106. Additionally, RAM 110 may contain operating system 112, application programs 114, other executable code 116 and program data 118. RAM 110 typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by CPU 102.

The computer system 100 may also include other removable/non-removable, volatile/nonvolatile computer storage media. By way of example only, FIG. 1 illustrates a hard disk drive 122 that reads from or writes to non-removable, nonvolatile magnetic media, and storage device 134 that may be an optical disk drive or a magnetic disk drive that reads from or writes to a removable, a nonvolatile storage medium 144 such as an optical disk or magnetic disk. Other removable/non-removable, volatile/nonvolatile computer storage media that can be used in the exemplary computer system 100 include, but are not limited to, magnetic tape cassettes, flash memory cards, digital versatile disks, digital video tape, solid state RAM, solid state ROM, and the like. The hard disk drive 122 and the storage device 134 may be typically connected to the system bus 120 through an interface such as storage interface 124.

The drives and their associated computer storage media, discussed above and illustrated in FIG. 1, provide storage of computer-readable instructions, executable code, data structures, program modules and other data for the computer system 100. In FIG. 1, for example, hard disk drive 122 is illustrated as storing operating system 112, application programs 114, other executable code 116 and program data 118. A user may enter commands and information into the computer system 100 through an input device 140 such as a keyboard and pointing device, commonly referred to as mouse, trackball or touch pad tablet, electronic digitizer, or a microphone. Other input devices may include a joystick, game pad, satellite dish, scanner, and so forth. These and other input devices are often connected to CPU 102 through an input interface 130 that is coupled to the system bus, but may be connected by other interface and bus structures, such as a parallel port, game port or a universal serial bus (USB). A display 138 or other type of video device may also be connected to the system bus 120 via an interface, such as a video interface 128. In addition, an output device 142, such as speakers or a printer, may be connected to the system bus 120 through an output interface 132 or the like computers.

The computer system 100 may operate in a networked environment using a network 136 to one or more remote computers, such as a remote computer 146. The remote computer 146 may be a personal computer, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the computer system 100. The network 136 depicted in FIG. 1 may include a local area network (LAN), a wide area network (WAN), or other type of network. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and the Internet. In a networked environment, executable code and application programs may be stored in the remote computer. By way of example, and not limitation, FIG. 1 illustrates remote executable code 148 as residing on remote computer 146. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used.

Feature Selection for Text Classification Using Subspace Sampling

The present invention is generally directed towards a system and method of feature selection for text classification using subspace sampling. A text as used herein may mean a document, web page, email or other representation of a set of characters. A simple unsupervised algorithm for feature selection is presented and applied to the RLSC problem. In particular, a subspace of features from a corpus of training data may be randomly sampled according to a probability distribution over the set of training features. Accordingly, a univariate “score” or “importance” may be assigned to every feature, then a small number of features may be randomly sampled, and the RLSC problem induced on those features may be solved.

As will be seen, the present invention chooses a small number of these features that preserve the relevant geometric structure in the data by using a sufficiently simple and sufficiently rich feature selection strategy that may perform well when evaluated against common feature selection algorithms. As will be understood, the various block diagrams, flow charts and scenarios described herein are only examples, and there are many other scenarios to which the present invention will apply.

Turning to FIG. 2 of the drawings, there is shown a block diagram generally representing an exemplary architecture of system components for feature selection for text classification using subspace sampling. Those skilled in the art will appreciate that the functionality implemented within the blocks illustrated in the diagram may be implemented as separate components or the functionality of several or all of the blocks may be implemented within a single component. For example, the functionality of the feature selector using subspace sampling 206 may be implemented as a separate component from the text classifier generator 204. Moreover, those skilled in the art will appreciate that the functionality implemented within the blocks illustrated in the diagram may be executed on a single computer or distributed across a plurality of computers for execution.

In various embodiments, a computer 202, such as computer system 100 of FIG. 1, may include a text classifier generator 204 operably coupled to a text classifier 208 and storage 210. In general, the text classifier generator 204 and the text classifier 208 may be any type of executable software code such as a kernel component, an application program, a linked library, an object with methods, and so forth. The storage 210 may be any type of computer-readable media and may store a training corpus 212 of training texts 214, each described by training features 216 and a class label 218, and classes 220 of texts 222 classified by a set of selected features 224. In an embodiment, training features 216 from the training corpus 212 may be used by the text classifier generator 204 to train a text classifier 208 to classify unseen texts 222 into classes 220 by a set of selected features 224.

The text classifier generator 204 may learn classification functions for each of the classes and may include a feature selector using subspace sampling 206 for training a text classifier 208 by selecting a small number of features using subspace sampling. Each of these modules may also be any type of executable software code such as a kernel component, an application program, a linked library, an object with methods, or other type of executable software code. Upon selecting a small number of features, a text classifier 208 may be output with the small set of features for classifying unseen texts.

There are many applications which may use the present invention of feature selection for text classification using subspace sampling. Many internet applications that use automated text classification can involve many categories and a very large feature space where the features consist of a large vocabulary of words and phrases that may be many times the size of the representation of a text. For example, a document classification application may use the present invention to select only the relevant features among a very large number of features to speed up classification of documents. Many other internet applications may use the present invention for text classification where the content of web pages such as chat pages, blog pages, a stream of news items, email, and so forth, may change rapidly, and classification of a web page may be performed online to select content. For any of these applications, the present invention may be used, especially when computational resources including memory, processing time, and network transmission time, require that textual content be represented using a small number of features.

In general, learning a classification function can be regarded as approximating a multivariate function from sparse data. This problem is solved in classical regularization theory by finding a function f that simultaneously has small empirical error and small norm in a Reproducing Kernel Hilbert Space (RKHS). That is, if the data consist of d examples (z₁,y₁), . . . , (z_(d),y_(d)), where z_(i)ε

and y_(i)ε{−1,+1}, then a Tikhonov regularization problem may be solved to find a function f that minimizes

${{\begin{matrix} \min \\ {f \in H} \end{matrix}{\sum\limits_{i = 1}^{d}{V\left( {y_{i},{f\left( z_{i} \right)}} \right)}}} + {\lambda {f}_{K}^{2}}},$

where V(.,.) is a loss function, ∥f∥_(K) is a norm in a RKHS H defined by the positive definite function K, d is the number of data points, and λ is a regularization parameter. See, for example, T. Evgeniou, M. Pontil, and T. Poggio, Regularization Networks and Support Vector Machines, Advances in Computational Mathematics, 13(1):1-50, 1999; A. N. Tikhonov and V. Y. Arsenin, Solutions of Ill-Posed Problems, W. H. Winston, Washington, D.C., 1977; and V. N. Vapnik, Statistical Learning Theory, Wiley, New York, 1998. Under general conditions, any fεH minimizing

${\begin{matrix} \min \\ {f \in H} \end{matrix}{\sum\limits_{i = 1}^{d}{V\left( {y_{i},{f\left( z_{i} \right)}} \right)}}} + {\lambda {f}_{K}^{2}}$

admits a representation of the form:

${{f(q)} = {\sum\limits_{i = 1}^{d}{x_{i}{K\left( {q,z_{i}} \right)}}}},$

for some set of coefficients x_(i), i={1, . . . , d}. See Bernhard Scholkopf, Ralf Herbrich, Alex J. Smola, and Robert C. Williamson, A Generalized Representer Theorem, In Proceedings of the 14th Annual Conference on Computational Learning Theory (COLT2001) and the 5th European Conference on Computational Learning Theory (EuroCOLT 2001), pages 416-426, 2001. Thus, the optimization problem

${\begin{matrix} \min \\ {f \in H} \end{matrix}{\sum\limits_{i = 1}^{d}{V\left( {y_{i},{f\left( z_{i} \right)}} \right)}}} + {\lambda {f}_{K}^{2}}$

can be reduced to finding a set of coefficients x_(i), i={1, . . . , d}. The theory of Vapnik then justifies the use of regularization functionals of the form appearing in

${\begin{matrix} \min \\ {f \in H} \end{matrix}{\sum\limits_{i = 1}^{d}{V\left( {y_{i},{f\left( z_{i} \right)}} \right)}}} + {\lambda {f}_{K}^{2}}$

for learning from finite data sets. If one chooses the square loss function, V(y,f(z))=(y−f(z))², then, by combining V(y,f(z))=(y−f(z))² with

${{{\begin{matrix} \min \\ {f \in H} \end{matrix}{\sum\limits_{i = 1}^{d}{V\left( {y_{i},{f\left( z_{i} \right)}} \right)}}} + {\lambda {f}_{K}^{2}\mspace{14mu} {and}\mspace{14mu} {f(q)}}} = {\sum\limits_{i = 1}^{d}{x_{i}{K\left( {q,z_{i}} \right)}}}},$

the following Regularized Least Squares Classification (RLSC) problem may be obtained:

${{\begin{matrix} \min \\ {x \in \Re^{d}} \end{matrix}{{{Kx} - y}}_{2}^{2}} + {\lambda \; x^{T}{Kx}}},$

where the d×d kernel matrix K is defined over the finite training data set and y is a d-dimensional {+1} class label vector. See for example T. Evgeniou, M. Pontil, and T. Poggio, Regularization Networks and Support Vector Machines, Advances in Computational Mathematics, 13(1):1-50, 1999; and R. Rifkin, G. Yeo, and T. Poggio, Regularized Least-squares Classification, in J. A. K. Suykens, G. Horvath, S. Basu, C. Micchelli, and J. Vandewalle, editors, Advances in Learning Theory: Methods, Models and Applications, NATO Science Series III: Computer and Systems Sciences, pages 131-154. VIOS Press, 2003.

As is standard, a document may be represented by an n-dimensional feature vector, and thus a corpus of d training documents may be represented as an n×d matrix A. Similarly, an identity mapping to the feature space may be represented by a kernel expressed as K=A^(T)A. If the Singular Value Decomposition (SVD) of A is A=UΣV^(T), then the solution and residual of

${\begin{matrix} \min \\ {x \in \Re^{d}} \end{matrix}{{{Kx} - y}}_{2}^{2}} + {\lambda \; x^{T}{Kx}}$

may be expressed as: x_(OPT)=V(Σ²+λI)⁻¹V^(T)y. The vector x_(OPT) characterizes a classification function of the form

${f(q)} = {\sum\limits_{i = 1}^{d}{x_{i}{K\left( {q,z_{i}} \right)}}}$

that generalizes well to new data. Thus, if qε

is a new test or query document, then from

${f(q)} = {\sum\limits_{i = 1}^{d}{x_{i}{K\left( {q,z_{i}} \right)}}}$

the following binary classification function may be derived: f(q)=x_(OPT) ^(T)A^(T)q. That is, given a new document q to be classified, if f(q)>0 then q is classified as belonging to the class in question, and not otherwise.

Accordingly, a regularized least-squares classification problem of the form

${\begin{matrix} \min \\ {x \in \Re^{d}} \end{matrix}{{{Kx} - y}}_{2}^{2}} + {\lambda \; x^{T}{Kx}}$

may be solved exactly or approximately to get a vector to classify successfully a new document according to a classification function of the form f(q)=x_(OPT) ^(T)A^(T)q. By choosing a small number r of features, where d≦r<<n, good classification quality may be obtained by using only those r features when compared to using the full set of n features. In an embodiment, feature selection and classification may generally be implemented by the following pseudo-code using sampling for Regularized Least Squares classification:

SRLS Algorithm Input: A ∈

^(n×d); y ∈

^(d); q ∈

^(n); λ ∈

⁺; {p_(i) ∈ [0,1]:i ∈ [n], p_(i) ≧ 0, Σ_(i)p_(i) = 1}, and a positive integer r ≦ n. Output: A solution vector {tilde over (x)}_(OPT) ∈

^(d); a residual {tilde over (Z)} ∈

; and a classification {tilde over (f)}. for i = 1, . . . , n do   Pick i with probability {tilde over (p)}_(i) = min{1, rp_(i)};   if i is picked then     Include A_((i))/√{tilde over (p)}_(i) as a row of Ã;     Include q_(i)/√{tilde over (p)}_(i) as the corresponding element of {tilde over (q)}; end Set {tilde over (K)} = Ã^(T)Ã; Solve  x ~ OPT = arg   min x ∈ d   K ~  x - y  2 2 + λx T  K ~  x ; Set  ${\overset{\sim}{Z} = {{{{\overset{\sim}{K}{\overset{\sim}{x}}_{OPT}} - y}}_{2}^{2} + {\lambda {\overset{\sim}{x}}_{OPT}^{T}\overset{\sim}{K}{\overset{\sim}{x}}_{OPT}}}};$ Compute {tilde over (f)} = f({tilde over (q)}) = {tilde over (q)}^(T)Ã{tilde over (x)}_(OPT). The SRLS Algorithm may take as input the n×d term-document (or feature-document) matrix A, a vector yε

^(d) of document labels where sign(y_(j))labels the class of document A^((j)) (where A^((j)) denotes the j^(th) column of the matrix A and A_((i)) denotes the i^(th) row of A), and a query document qε

^(n). The SRLS Algorithm also takes as input a regularization parameter λε

⁺, a probability n distribution {p_(i)}_(i=1) ^(n) over the features, and a positive integer r. The algorithm first randomly samples roughly r features according to the input probability distribution. Consider Ã be the matrix whose rows consist of the chosen feature vectors, rescaled appropriately, and consider {tilde over (q)} be the vector consisting of the corresponding elements of the input query document q, rescaled in the same manner. Then, if the d×d matrix {tilde over (K)}=Ã^(T)Ã may be defined as an approximate kernel, the algorithm next solves the following RLSC problem:

${{\begin{matrix} \min \\ {x \in \Re^{d}} \end{matrix}{{{\overset{\sim}{K}x} - y}}_{2}^{2}} + {\lambda \; x^{T}\overset{\sim}{K}x}},$

thereby obtaining an optimal vector {tilde over (x)}_(OPT). Finally, the algorithm classifies the query q by computing, {tilde over (f)}=f({tilde over (q)})={tilde over (q)}^(T)Ã{tilde over (x)}_(OPT). If {tilde over (f)}≧0, then q is labeled ‘positive’; and otherwise, q is labeled ‘negative’.

FIG. 3 presents a flowchart generally representing the steps undertaken in one embodiment for feature selection for text classification using subspace sampling. The steps of FIG. 3 represent the general steps of the pseudo-code of the SRLS Algorithm presented above. At step 302, a corpus of classified training texts described by features may be received. For instance, an n×d term-document (or feature-document) matrix A and a vector yε

^(d) of document labels where sign(y_(j)) labels the class of document A^((j)) may be received as input to the SRLS Algorithm. At step 304, a subset of features may be selected using subspace sampling. In particular, a subspace of features may be randomly sampled according to a probability distribution over the set of features. This is described in more detail in conjunction with FIG. 4 below. The subset of features selected by subspace sampling may be output at step 306. The SRLS Algorithm may obtain and store an optimal vector {tilde over (x)}_(OPT) by solving the RLSC problem:

${\begin{matrix} \min \\ {x \in \Re^{d}} \end{matrix}{{{\overset{\sim}{K}x} - y}}_{2}^{2}} + {\lambda \; x^{T}\overset{\sim}{K}{x.}}$

At step 308, a text described: by features may be received, such as a query document qε

^(n). At step 310, the text may be classified using the subset of features selected by subspace sampling. For instance, the SRLS Algorithm classifies the query q by computing, {tilde over (f)}=f({tilde over (q)})={tilde over (q)}^(T)Ã{tilde over (x)}_(OPT). And at step 312, the classification of the text may be output. For example, if {tilde over (f)}≧0 upon computing {tilde over (f)}=f({tilde over (q)})={tilde over (q)}^(T)Ã{tilde over (x)}_(OPT), then q is labeled ‘positive’ as a document label indicating q belongs to the class; and otherwise, q is labeled ‘negative’.

FIG. 4 presents a flowchart generally representing the steps undertaken in one embodiment for selecting a subset of features using subspace sampling. At step 402, a subspace of features may be randomly sampled according to a probability distribution over the set of features. Considering all n features, a feature may be randomly selected in an embodiment by probability, {tilde over (p)}_(i)=min{1,rp_(i)}, according to a probability distribution over the set of features such as subspace sampling probability p_(i)=∥U_(k(i))∥₂ ²/k, where the probability of choosing each feature is proportional to the length squared of the corresponding row of the matrix U_(k) consisting of the top k left singular vectors of A. At step 404, a subset of features may be selected from the subspace of randomly sampled features. In an embodiment, A_((i))/√{square root over ({tilde over (p)}_(i))} may be included as a row of A for each feature randomly selected. For example, the SLRS Algorithm computes, for every iε{1, . . . , n}, a probability {tilde over (p)}_(i)=min{1,rp_(i)}ε[0,1], and then the i^(th) row of A is chosen with probability {tilde over (p)}_(i). At step 406, a kernel matrix may be defined over the subset of features selected from the subspace of randomly sampled features, and an optimal vector of the subset of features that characterize a classification function using the kernel matrix may be determined at step 408. For instance, the d×d matrix {tilde over (K)}=Ã^(T)Ã may be defined as an approximate kernel, and the SLRS Algorithm solves

${\begin{matrix} \min \\ {x \in \Re^{d}} \end{matrix}{{{\overset{\sim}{K}x} - y}}_{2}^{2}} + {\lambda \; x^{T}\overset{\sim}{K}x\mspace{14mu} {to}}$

obtain an optimal vector {tilde over (x)}_(OPT). And the quality of fitting the subset of features to the set of features may be measured at step 410, for instance by computing {tilde over (Z)}=∥{tilde over (K)}{tilde over (x)}_(OPT)−y∥₂ ²+λ{tilde over (x)}_(OPT) ^(T){tilde over (K)}{tilde over (x)}_(OPT).

An important aspect of SLRS Algorithm is the probability distribution {p_(i)}_(i=1) ^(n) input to the algorithm. Although random sampling could be performed with respect to any probability distribution, more intelligent sampling can lead to improved classification performance, both theoretically and empirically. In an embodiment, a subspace sampling probability distribution

${p_{i} = \frac{{U_{(i)}}_{2}^{2}}{d}},{\forall{i \in {1\mspace{11mu} \ldots \mspace{11mu} n}}},$

may be passed to the SRLS Algorithm, where the probability of choosing each feature is proportional to the length squared of the corresponding row of the matrix U_(k) consisting of the top k left singular vectors of A. More formally, subspace sampling of features representing documents means sampling the features using a probability distribution where the probability of choosing each feature is proportional to the square of the Euclidean norms of the rows of the left singular vectors of an n×d matrix of the features representing a corpus of documents, such as matrix A for instance. Roughly Õ(d/ε²) features may be randomly sampled according to this carefully chosen probability distribution. In various embodiments, a subspace sampling probability distribution

${p_{i} = \frac{{U_{(i)}}_{2}^{2}}{d}},{\forall{i \in {1\mspace{11mu} \ldots \mspace{11mu} n}}}$

may be generalized in an embodiment to p_(i)=∥U_(k(i))∥₂ ²/k to permit k to be a parameter.

Also, note that rather than using the probability distribution {p_(i)}_(i=1) ^(n) over the features directly in r independent and identically distributed sampling trials which might lead to the same feature being chosen multiple times, the SRLS Algorithm computes, for every iε{1, . . . , n}, a probability {tilde over (p)}_(i)=min{1,rp_(i)}ε[0,1], and then the i^(th) row of A is chosen with probability {tilde over (p)}_(i). Thus, r actually specifies an upper bound on the expected number of chosen rows of A: if X_(i) is a random variable that indicates whether the i^(th) row is chosen, then the expected number of chosen rows is r′=E[Σ_(i)X_(i)]=Σ_(i)min{1,rp_(i)}≦rΣ_(i)p_(i)=r.

The SRLS Algorithm may also flexibly use other probability distributions {p_(i)}_(i=1) ^(n) input to the algorithm for randomly sampling features. In various embodiments, weight-based sampling of features may be used, where the probability of choosing each feature is proportional to the length squared of the corresponding row of the matrix A, namely p_(i)=∥A_((i))∥₂ ²/∥A∥_(k) ². Or, uniform sampling of features may be used, where the probability of choosing each feature is equal, such that p_(i)=1/n, for all i=1, . . . , n.

Thus the present invention may efficiently select a small set of features by intelligent sampling for improved classification performance. Various probability distributions may be flexibly used for randomly sampling features, and such a feature selection strategy may preserve the relevant geometric structure in the training data. The system and method of the present invention may typically reduce the number of features by an order of magnitude or more from sets of training features and allow small feature sets to represent documents that may change rapidly and require classification to be performed, especially online.

As can be seen from the foregoing detailed description, the present invention provides an improved system and method for feature selection for text classification using subspace sampling. A small subset of features may be selected by randomly sampling a subspace of features from a corpus of training data according to a probability distribution over the set of features. Advantageously, the small set of features may classify texts using only the relevant features among a very large number of training features. Such a system and method may support many web applications for text classification, and may also be applied to other domains where the text is required to be represented by a small number of features. As a result, the system and method provide significant advantages and benefits needed in contemporary computing.

While the invention is susceptible to various modifications and alternative constructions, certain illustrated embodiments thereof are shown in the drawings and have been described above in detail. It should be understood, however, that there is no intention to limit the invention to the specific forms disclosed, but on the contrary, the intention is to cover all modifications, alternative constructions, and equivalents falling within the spirit and scope of the invention. 

1. A computer system for classification, comprising: a text classifier using a plurality of features selected by subspace sampling from a corpus of training data for classification of a document; and a storage operably coupled to the text classifier for storing a plurality of texts classified using the plurality of features selected by subspace sampling into a plurality of classes.
 2. The system of claim 1 further comprising a text classifier generator operably coupled to the storage for learning a classification function for each of the plurality of classes to train the text classifier for using the plurality of features selected by subspace sampling for classification of the document.
 3. The system of claim 1 further comprising a feature selector using subspace sampling operably coupled to the text classifier generator for selecting the plurality of features using subspace sampling from the corpus of training data for classification of the document.
 4. A computer-readable medium having computer-executable components comprising the system of claim
 1. 5. A computer-implemented method for classification, comprising: receiving a text represented by a plurality of features for classification; classifying the text using a subset of the plurality of features selected from the plurality of features by subspace sampling; and outputting the classification of the text classified using the subset of the plurality of features selected by subspace sampling.
 6. The method of claim 5 further comprising receiving a corpus of classified training texts represented by a plurality of features for classification of a document.
 7. The method of claim 5 further comprising receiving a probability distribution over a plurality of features from a corpus of training texts, the probability distribution having a probability assigned to each of the plurality of features that is proportional to a square of Euclidean norms of a plurality of rows of a plurality of left singular vectors of a matrix of the plurality of features representing the corpus of training texts.
 8. The method of claim 5 further comprising selecting the subset of the plurality of features from the plurality of features by subspace sampling.
 9. The method of claim 8 further comprising outputting the subset of the plurality of features selected from the plurality of features by subspace sampling.
 10. The method of claim 8 wherein selecting the subset of the plurality of features from the plurality of features by subspace sampling comprises randomly sampling a subspace of the plurality of features using a probability distribution with a probability assigned to each of the plurality of features that is proportional to a square of Euclidean norms of a plurality of rows of a plurality of left singular vectors of a matrix of the plurality of features representing the corpus of training texts.
 11. The method of claim 8 wherein selecting the subset of the plurality of features from the plurality of features by subspace sampling comprises selecting the subset of the features from the randomly sampled subspace of the plurality of features using a probability distribution with a probability assigned to each of the plurality of features that is proportional to a square of Euclidean norms of a plurality of rows of a plurality of left singular vectors of a matrix of the plurality of features representing the corpus of training texts.
 12. The method of claim 5 wherein selecting the subset of the plurality of features from the plurality of features by subspace sampling comprises defining a kernel matrix over the subset of the plurality of features selected from a sampled subspace of the plurality of features.
 13. The method of claim 5 wherein selecting the subset of the plurality of features from the plurality of features by subspace sampling comprises determining an optimal vector representing the subset of the plurality of features that characterize a classification function using a kernel matrix defined over the subset of the plurality of features.
 14. The method of claim 5 wherein outputting the classification of the text classified using the subset of the plurality of features selected by subspace sampling comprises storing an association of the text and a class.
 15. A computer-readable medium having computer-executable instructions for performing the method of claim
 5. 16. A computer system for classification, comprising: means for selecting a subset of a plurality of features from a corpus of classified training texts represented by the plurality of features; and means for outputting the subset of the plurality of features selected from the corpus of classified training texts represented by the plurality of features.
 17. The computer system of claim 16 further comprising means for classifying a text using the subset of the plurality of features selected from the corpus of classified training texts represented by the plurality of features.
 18. The computer system of claim 17 further comprising means for outputting a text classifier using the subset of the plurality of features selected from the corpus of classified training texts represented by the plurality of features.
 19. The computer system of claim 16 wherein means for selecting the subset of the plurality of features from the corpus of classified training texts represented by the plurality of features comprises means for using a probability distribution with a probability assigned to each of the plurality of features to select the subset of the plurality of features.
 20. The computer system of claim 16 wherein means for selecting the subset of the plurality of features from the corpus of classified training texts represented by the plurality of features comprises means for randomly sampling a subspace of the plurality of features. 